Time-Dependent Multi-Depot Heterogeneous Vehicle Routing Problem Considering Temporal–Spatial Distance

Aiming at the multi-depot heterogeneous vehicle routing problem under time-dependent road network and soft time window, considering fixed cost, window penalty cost transportation an optimization model of is established with objective minimizing distribution cost. According to characteristics problem, a hybrid genetic algorithm variable neighborhood search temporal–spatial distance designed. Customers are clustered according generate initial solutions, which improves quality algorithm. The depth capability applied local strategy enhance An adaptive number new acceptance mechanism simulated annealing proposed balance breadth required for population evolution. validity verified by several sets examples different scales. research results not only deepen expand relevant on but also provide theoretical basis logistics enterprises optimize scheme.